Ordered Task Decomposition

نویسندگان

  • Dana Nau
  • David W. Aha
  • Héctor Muñoz-Avila
چکیده

Ordered Task Decomposition is a new approach to HTN planning that appears to work quite well in a diverse set of real-world planning problems. This paper summarizes what Ordered Task Decomposition is, describes our past and current work on it, and describes our plans for future work.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AAAI - 94 1 Task - Decomposition via Plan Parsing

Task-decomposition planners make use of schemata that de ne tasks in terms of partially ordered sets of tasks and primitive actions. Most existing taskdecomposition planners synthesize plans via a topdown approach, called task reduction, which uses schemata to replace tasks with networks of tasks and actions until only actions remain. In this paper we present a bottom-up plan parsing approach t...

متن کامل

Task-Decomposition via Plan Parsing

Task-decomposition planners make use of schemata that de ne tasks in terms of partially ordered sets of tasks and primitive actions. Most existing taskdecomposition planners synthesize plans via a topdown approach, called task reduction, which uses schemata to replace tasks with networks of tasks and actions until only actions remain. In this paper we present a bottom-up plan parsing approach t...

متن کامل

Ordered categories and ordered semigroups

We use ordered categories to study semidirect decompositions of finite ordered semigroups. We obtain ordered analogues of the derived category theorem and of the delay theorem. Next we prove that the ordered analogues of semilattices and of J -trivial monoids constitute local varieties, and we derive some decomposition theorems from these results. In [10], Pin and Weil initiated a study of the ...

متن کامل

On the Decomposition and Concurrent Resolution of a Planning Problem

Planning is known to be a difficult task. One of the approaches used to reduce this difficulty is problem decomposition under divide-and-conquer methodology. This paper introduces a new decomposition technique for planning problems in STRIPS domains which is based on the idea of landmark, that is, literals that must be true in any solution plan. These landmarks are ordered and grouped in differ...

متن کامل

Task-Decomposition via Plan

Task-decomposition planners make use of schemata that define tasks in terms of partially ordered sets of tasks and primitive actions. Most existing taskdecomposition planners synthesize plans via a topdown approach, called taslc reduction, which uses schemata to replace tasks with networks of tasks and actions until only actions remain. In this paper we present a bottom-up plan pursing approach...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000